Simulated results showed that the proposed algorithm is available to construct effectively and quickly, the multicast tree satisfying delay constraint and lowest link cost, with network load balance taken into account to pick out the cheaper idle route. 仿真结果表明,该算法在考虑网络的负载均衡情况下,选择链路代价较低的空闲路径,快速、有效地构建满足时延要求,链路代价最小的组播树。
Based on the grid clustering, the mobile agents will choose the idle route in the network to collect, update and caching the resource information because of the autonomy of mobile agent. 在对网格进行分簇的基础上,利用移动Agent的自主性,让移动Agent自主选择网络中空闲路径进行资源信息的收集、更新、跨簇缓存等操作。